Resource allocation pattern in infrastructure networks
نویسندگان
چکیده
منابع مشابه
Resource allocation pattern in infrastructure networks
Most infrastructure networks evolve and operate in a decentralized fashion, which may adversely impact the allocation of resources across the system. Here we investigate this question by focusing on the relation between capacity and load in various such networks. We find that, due to network traffic fluctuations, real systems tend to have larger unoccupied portions of the capacities—smaller loa...
متن کاملBicriteria Resource Allocation Problem in Pert Networks
We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...
متن کاملA Coordinated Resource Allocation Algorithm for Infrastructure-Based Relay Networks
A resource allocation algorithm for orthogonal frequency division multiple access-based and infrastructure-based relay networks is introduced in this paper. The algorithm is applied in the downlink of a single cell. Channel state information is exploited at the transmitting base station (BS) and at the transmitting relay stations (RSs). The algorithm coordinates the allocation of subcarriers, b...
متن کاملDownlink Resource Allocation for Autonomous Infrastructure-based Multihop Cellular Networks
Considering a multihop cellular system with one relay per sector, an effective modeling for the joint base-station/relay assignment, rate allocation, and routing scheme is proposed and formulated under a single problem for the downlink. This problem is then formulated as a multidimensional multichoice knapsack problem (MMKP) to maximize the total achieved throughput in the network. The well-kno...
متن کاملResource Allocation in Networks
Most work on constraint satisfaction problems (CSP) starts with a standard problem deenition and focuses on algorithms for nd-ing solutions. However, formulating a CSP so that it can be solved by such methods is often a diicult problem in itself. In this paper, we consider the problem of routing in networks, an important problem in communication networks. It is as an example of a problem where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2008
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/41/22/224019